Learnability of type-logical grammars

Learnability of type-logical grammars

A procedure for learning a lexical assignment together with a system of syntactic and semantic categories given a fixed type-logical grammar is briefly described. The logic underlying the grammar can be any cut-free decidable modally enriched extension of the Lambek calculus, but the correspondence between syntactic and semantic categories must be constrained so that no infinite set of categori...

Learnability of type - logi al grammars Sean

Underspecification in Type-Logical Grammars

Abstract. We show how in a mixed multimodal categorial framework unary modalities can be used to represent morphosyntactic properties of expressions. The residuation logic for the unary connectives, is used to define a feature checking procedure. Each mode represents some morphosyntactic feature. Underspecification is dealt with by assuming general modes that are related to specific instances b...

Learnability of Pregroup Grammars

This paper investigates the learnability by positive examples in the sense of Gold of Pregroup Grammars. In a first part, Pregroup Grammars are presented and a new parsing strategy is proposed. Then, theoretical learnability and non-learnability results for subclasses of Pregroup Grammars are proved. In the last two parts, we focus on learning Pregroup Grammars from a special kind of input call...

Formalising Type-Logical Grammars in Agda

In recent years, the interest in using proof assistants to formalise and reason about mathematics and programming languages has grown. Type-logical grammars, being closely related to type theories and systems used in functional programming, are a perfect candidate to next apply this curiosity to. The advantages of using proof assistants is that they allow one to write formally verified proofs a...